A Common Nomenclature for Stated Preference Elicitation Approaches

A Common Nomenclature for Stated Preference Elicitation Approaches

It is often difficult to determine what actually was done in work involving data collected with stated preference surveys because the terms used to describe various procedures have ambiguous and sometimes conflicting meanings. Further, terms used to describe data collection procedures often are confounded with terms used to describe statistical techniques. We call for the use of a common nomenc...

Computational Approaches to Preference Elicitation

Approaches to Preference Elicitation for Group Recommendation

Recommendation can be defined as the problem of selecting, among a set of items, those ones that are likely of interest to the user. In case of a group of users, recommendations should satisfy, as far as possible, the preferences of all the group members. In order to elicit the group preferences, we present two different mechanisms: the first one consists in a voting procedure whereas the secon...

Minimax Regret Approaches for Preference Elicitation with Rank-Dependent Aggregators

Recently there has been a growing interest in non-linear aggregation models to represent the preferences of a decision maker in a multicriteria decision problem. Such models are expressive as they are able to represent synergies (positive and negative) between attributes or criteria, thus modeling different decision behaviors. They also make it possible to generate Pareto-optimal solutions that...

Preference Elicitation for DCOPs

Distributed Constraint Optimization Problems (DCOPs) offer a powerful approach for the description and resolution of cooperative multi-agent problems. In this model, a group of agents coordinate their actions to optimize a global objective function, taking into account their preferences or constraints. A core limitation of this model is the assumption that the preferences of all agents or the c...